Visualization for Structured Constraint Satisfaction Problems
نویسندگان
چکیده
Constraint satisfaction problems are mathematical models of real-world problems. In contrast to randomly generated artificial problems, real-world problems usually have nonrandom structure. Knowledge about that structure, when identified in advance, can make search to find solutions more effective. This paper introduces DrawCSP, a visualization program that can show both the original and the discovered structure of constraint satisfaction problems. DrawCSP provides insight into both search algorithm design and into the challenges real-world problems present.
منابع مشابه
From Unsolvable to Solvable: An Exploration of Simple Changes
This paper investigates how readily an unsolvable constraint satisfaction problem can be reformulated so that it becomes solvable. We investigate small changes in the definitions of the problem’s constraints, changes that alter neither the structure of its constraint graph nor the tightness of its constraints. Our results show that structured and unstructured problems respond differently to suc...
متن کاملComplexity of K-Tree Structured Constraint Satisfaction Problems
Trees have played a key role in the study of constraint satisfaction problems because problems with tree structure can be solved efficiently. It is shown here that a family of generalized trees, k-trees, can offer increasing representational complexity for constraint satisfaction problems, while maintaining a bound on computational complexity linear in the number of variables and exponential in...
متن کاملA Local Search Framework for Semiring-Based Constraint Satisfaction Problems
Solving semiring-based constraint satisfaction problem (SCSP) is a task of finding the best solution, which can be viewed as an optimization problem. Current research of SCSP solution methods focus on tree search algorithms, which is computationally intensive. In this paper, we present an efficient local search framework for SCSPs, which adopts problem transformation and soft constraint consist...
متن کاملSearch on Constraint Satisfaction Problems with Sparse Secondary Structure
This paper considers a variety of ways to detect relatively isolated, highly restricted subproblems and then exploit them to guide search for a solution. It introduces a local search method that, prior to search, estimates where such subproblems lie within constraint satisfaction problems. These subproblems are assembled into a secondary structure used with dynamic variable-ordering heuristics ...
متن کاملA New Method for Solving Constraint Satisfaction Problems
Many important problems in Artificial Intelligence can be defined as Constraint Satisfaction Problems (CSP). These types of problems are defined by a limited set of variables, each having a limited domain and a number of Constraints on the values of those variables (these problems are also called Consistent Labeling Problems (CLP), in which “Labeling means assigning a value to a variable.) Solu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010